An Assertional Proof System for Multithreaded Java - Theory and Tool Support

Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread classes, allowing for a multithreaded flow of control. The concurrency model includes shared-variable concurrency via instance variables, coordination via reentrant synchronization monitors, synchronous message passing, and dynamic thread creation. To reason about safety properties of multithreaded Java programs, we introduce a tool-supported assertional proof method for JavaMT ("Multi-Threaded Java"), a small sublanguage of Java, covering the mentioned concurrency issues as well as the object-based core of Java. The verification method is formulated in terms of proof-outlines, where the assertions are layered into local ones specifying the behavior of a single instance, and global ones taking care of the connections between objects. We establish the soundness and the completeness of the proof system. From an annotated program, a number of verification conditions are generated and handed over to the interactive theorem prover PVS.IST project Omega (IST-2001-33522) NWO/DFG project Mobi-J (RO 1122/9-1, RO 1122/9-2)UBL - phd migration 201

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra

There are several methods for the synthesis and analysis of hybrid systems that require efficient algorithms and tools for satisfiability checking. For analysis, e.g., bounded model checking describes counterexamples of a fixed length by logical formulas, whose satisfiability corresponds to the existence of such a counterexample. As an example for parameter synthesis, we can state the correctness of a parameterized system by a logical formula; the solution set of the formula gives us possible safe instances of the parameters. For discrete systems, which can be described by propositional logic formulas, SAT-solvers can be used for the satisfiability checks. For hybrid systems, having mixed discrete-continuous behavior, SMT-solvers are needed. SMT-solving extends SAT with theories, and has its main focus on linear arithmetic, which is sufficient to handle, e.g., linear hybrid systems. However, there are only few solvers for more expressive but still decidable logics like the first-order theory of the reals with addition and multiplication -- real algebra. Since the synthesis and analysis of non-linear hybrid systems requires such a powerful logic, we need efficient SMT-solvers for real algebra. Our goal is to develop such an SMT-solver for the real algebra, which is both complete and efficient

TECNOEDUCACIÓN. Herramienta informática para apoyar los procesos educativos de los colegios oficiales del municipio de Mosquera

Trabajo de InvestigaciónLa investigación presenta un estudio social y financiero de una propuesta que mejore los procesos educativos en los colegios oficiales del municipio de Mosquera Cundinamarca. A partir de lo anterior se propuso el diseño de una herramienta informática que permitiera conectar a la comunidad educativa y que brindara servicios especiales a cada usuario dependiendo de sus necesidades. Finalmente realizó la evaluación social y financiera del proyecto para determinar su viabilidad.Trabajo de InvestigaciónINTRODUCCIÓN 1. ANTECEDENTES 2. PROBLEMA 3. OBJETIVO 4. PREGUNTAS DE INVESTIGACIÒN 5. ASPECTOS LEGALES 6. MARCO CONCEPTUAL 7. MARCO TEÓRICO 8. DIAGNOSTICO 9. PROPUESTA 10.CONCLUSIONES 11.RECOMENDACIONES BIBLIOGRAFÍA ANEXOSEspecializaciónEspecialista en Formulación y Evaluación Social y Económica de Proyecto